0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.13 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.14/0.35 % Computer : n023.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 1920 0.14/0.35 % WCLimit : 240 0.14/0.35 % DateTime : Wed Jul 30 02:07:34 EDT 2025 0.14/0.35 % CPUTime : 0.22/0.51 Running higher-order theorem proving 0.22/0.51 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.fehFOGB9Xx/E---3.1_29010.p 0.22/0.53 # Version: 3.0.0-ho 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNSSA. 0.22/0.53 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.22/0.53 # Starting post_as_ho12 with 240s (1) cores 0.22/0.53 # Starting new_bool_9 with 240s (1) cores 0.22/0.53 # Starting post_as_ho1 with 240s (1) cores 0.22/0.53 # Starting post_as_ho4 with 240s (1) cores 0.22/0.53 # Starting post_as_ho2 with 240s (1) cores 0.22/0.53 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.22/0.53 # Starting full_lambda_10 with 240s (1) cores 0.22/0.53 # Starting new_ho_8 with 240s (1) cores 0.22/0.53 # post_as_ho1 with pid 29090 completed with status 0 0.22/0.53 # Result found by post_as_ho1 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNSSA. 0.22/0.53 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.22/0.53 # Starting post_as_ho12 with 240s (1) cores 0.22/0.53 # Starting new_bool_9 with 240s (1) cores 0.22/0.53 # Starting post_as_ho1 with 240s (1) cores 0.22/0.53 # No SInE strategy applied 0.22/0.53 # Search class: HGUNF-FFSS32-MSSFFSBN 0.22/0.53 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.22/0.53 # Starting post_as_ho12 with 130s (1) cores 0.22/0.53 # post_as_ho12 with pid 29098 completed with status 0 0.22/0.53 # Result found by post_as_ho12 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNSSA. 0.22/0.53 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.22/0.53 # Starting post_as_ho12 with 240s (1) cores 0.22/0.53 # Starting new_bool_9 with 240s (1) cores 0.22/0.53 # Starting post_as_ho1 with 240s (1) cores 0.22/0.53 # No SInE strategy applied 0.22/0.53 # Search class: HGUNF-FFSS32-MSSFFSBN 0.22/0.53 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.22/0.53 # Starting post_as_ho12 with 130s (1) cores 0.22/0.53 # Preprocessing time : 0.001 s 0.22/0.53 # Presaturation interreduction done 0.22/0.53 0.22/0.53 # Proof found! 0.22/0.53 # SZS status Theorem 0.22/0.53 # SZS output start CNFRefutation 0.22/0.53 thf(decl_23, type, cHALF: $i > $i > $o). 0.22/0.53 thf(decl_24, type, cDOUBLE: $i > $i > $o). 0.22/0.53 thf(decl_25, type, cS: $i > $i). 0.22/0.53 thf(decl_26, type, c0: $i). 0.22/0.53 thf(decl_27, type, esk1_3: ($i > $i > $o) > $i > $i > $i). 0.22/0.53 thf(decl_28, type, esk2_3: ($i > $i > $o) > $i > $i > $i). 0.22/0.53 thf(decl_29, type, esk3_0: $i). 0.22/0.53 thf(decl_30, type, esk4_0: $i). 0.22/0.53 thf(cTHM301, conjecture, ((((![X1:$i > $i > $o, X2:$i, X3:$i]:((((![X4:$i, X5:$i]:(((X1 @ X4 @ X5)=>(X1 @ (cS @ X4) @ (cS @ (cS @ X5)))))&(X1 @ c0 @ c0))&(cDOUBLE @ X2 @ X3))=>(X1 @ X2 @ X3)))&![X4:$i, X5:$i]:(((cHALF @ X4 @ X5)=>(cHALF @ (cS @ (cS @ X4)) @ (cS @ X5)))))&(cHALF @ (cS @ c0) @ c0))&(cHALF @ c0 @ c0))=>![X2:$i, X3:$i]:(((cHALF @ X3 @ X2)<=(cDOUBLE @ X2 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.fehFOGB9Xx/E---3.1_29010.p', cTHM301)). 0.22/0.53 thf(c_0_1, negated_conjecture, ~(((((![X1:$i > $i > $o, X2:$i, X3:$i]:((((![X4:$i, X5:$i]:(((X1 @ X4 @ X5)=>(X1 @ (cS @ X4) @ (cS @ (cS @ X5)))))&(X1 @ c0 @ c0))&(cDOUBLE @ X2 @ X3))=>(X1 @ X2 @ X3)))&![X4:$i, X5:$i]:(((cHALF @ X4 @ X5)=>(cHALF @ (cS @ (cS @ X4)) @ (cS @ X5)))))&(cHALF @ (cS @ c0) @ c0))&(cHALF @ c0 @ c0))=>![X2:$i, X3:$i]:(((cDOUBLE @ X2 @ X3)=>(cHALF @ X3 @ X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM301])])). 0.22/0.53 thf(c_0_2, negated_conjecture, ![X15:$i > $i > $o, X16:$i, X17:$i, X20:$i, X21:$i]:((((((((X15 @ (esk1_3 @ X15 @ X16 @ X17) @ (esk2_3 @ X15 @ X16 @ X17))|~(X15 @ c0 @ c0)|~(cDOUBLE @ X16 @ X17)|(X15 @ X16 @ X17))&(~(X15 @ (cS @ (esk1_3 @ X15 @ X16 @ X17)) @ (cS @ (cS @ (esk2_3 @ X15 @ X16 @ X17))))|~(X15 @ c0 @ c0)|~(cDOUBLE @ X16 @ X17)|(X15 @ X16 @ X17)))&(~(cHALF @ X20 @ X21)|(cHALF @ (cS @ (cS @ X20)) @ (cS @ X21))))&(cHALF @ (cS @ c0) @ c0))&(cHALF @ c0 @ c0))&((cDOUBLE @ esk3_0 @ esk4_0)&~(cHALF @ esk4_0 @ esk3_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.22/0.53 thf(c_0_3, negated_conjecture, ![X1:$i > $i > $o, X2:$i, X3:$i]:(((X1 @ X2 @ X3)|~((X1 @ (cS @ (esk1_3 @ X1 @ X2 @ X3)) @ (cS @ (cS @ (esk2_3 @ X1 @ X2 @ X3)))))|~((X1 @ c0 @ c0))|~((cDOUBLE @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_4, negated_conjecture, (cDOUBLE @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_5, negated_conjecture, ![X1:$i > $i > $o, X2:$i, X3:$i]:(((X1 @ (esk1_3 @ X1 @ X2 @ X3) @ (esk2_3 @ X1 @ X2 @ X3))|(X1 @ X2 @ X3)|~((X1 @ c0 @ c0))|~((cDOUBLE @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_6, negated_conjecture, ![X1:$i > $i > $o]:(((X1 @ esk3_0 @ esk4_0)|~((X1 @ (cS @ (esk1_3 @ X1 @ esk3_0 @ esk4_0)) @ (cS @ (cS @ (esk2_3 @ X1 @ esk3_0 @ esk4_0)))))|~((X1 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.22/0.53 thf(c_0_7, negated_conjecture, ![X2:$i, X3:$i]:(((cHALF @ (cS @ (cS @ X2)) @ (cS @ X3))|~((cHALF @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_8, negated_conjecture, (cHALF @ c0 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_9, negated_conjecture, ~((cHALF @ esk4_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.22/0.53 thf(c_0_10, negated_conjecture, ![X1:$i > $i > $o]:(((X1 @ (esk1_3 @ X1 @ esk3_0 @ esk4_0) @ (esk2_3 @ X1 @ esk3_0 @ esk4_0))|(X1 @ esk3_0 @ esk4_0)|~((X1 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_5, c_0_4])). 0.22/0.53 thf(c_0_11, negated_conjecture, ~((cHALF @ (esk2_3 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0) @ (esk1_3 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), c_0_9])). 0.22/0.53 thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_11]), c_0_9]), ['proof']). 0.22/0.53 # SZS output end CNFRefutation 0.22/0.53 # Parsed axioms : 5 0.22/0.53 # Removed by relevancy pruning/SinE : 0 0.22/0.53 # Initial clauses : 11 0.22/0.53 # Removed in clause preprocessing : 4 0.22/0.53 # Initial clauses in saturation : 7 0.22/0.53 # Processed clauses : 18 0.22/0.53 # ...of these trivial : 0 0.22/0.53 # ...subsumed : 0 0.22/0.53 # ...remaining for further processing : 18 0.22/0.53 # Other redundant clauses eliminated : 0 0.22/0.53 # Clauses deleted for lack of memory : 0 0.22/0.53 # Backward-subsumed : 0 0.22/0.53 # Backward-rewritten : 0 0.22/0.53 # Generated clauses : 16 0.22/0.53 # ...of the previous two non-redundant : 7 0.22/0.53 # ...aggressively subsumed : 0 0.22/0.53 # Contextual simplify-reflections : 0 0.22/0.53 # Paramodulations : 8 0.22/0.53 # Factorizations : 0 0.22/0.53 # NegExts : 0 0.22/0.53 # Equation resolutions : 2 0.22/0.53 # Disequality decompositions : 0 0.22/0.53 # Total rewrite steps : 2 0.22/0.53 # ...of those cached : 1 0.22/0.53 # Propositional unsat checks : 0 0.22/0.53 # Propositional check models : 0 0.22/0.53 # Propositional check unsatisfiable : 0 0.22/0.53 # Propositional clauses : 0 0.22/0.53 # Propositional clauses after purity: 0 0.22/0.53 # Propositional unsat core size : 0 0.22/0.53 # Propositional preprocessing time : 0.000 0.22/0.53 # Propositional encoding time : 0.000 0.22/0.53 # Propositional solver time : 0.000 0.22/0.53 # Success case prop preproc time : 0.000 0.22/0.53 # Success case prop encoding time : 0.000 0.22/0.53 # Success case prop solver time : 0.000 0.22/0.53 # Current number of processed clauses : 11 0.22/0.53 # Positive orientable unit clauses : 3 0.22/0.53 # Positive unorientable unit clauses: 0 0.22/0.53 # Negative unit clauses : 2 0.22/0.53 # Non-unit-clauses : 6 0.22/0.53 # Current number of unprocessed clauses: 2 0.22/0.53 # ...number of literals in the above : 8 0.22/0.53 # Current number of archived formulas : 0 0.22/0.53 # Current number of archived clauses : 7 0.22/0.53 # Clause-clause subsumption calls (NU) : 1 0.22/0.53 # Rec. Clause-clause subsumption calls : 1 0.22/0.53 # Non-unit clause-clause subsumptions : 0 0.22/0.53 # Unit Clause-clause subsumption calls : 0 0.22/0.53 # Rewrite failures with RHS unbound : 0 0.22/0.53 # BW rewrite match attempts : 0 0.22/0.53 # BW rewrite match successes : 0 0.22/0.53 # Condensation attempts : 0 0.22/0.53 # Condensation successes : 0 0.22/0.53 # Termbank termtop insertions : 2611 0.22/0.53 # Search garbage collected termcells : 286 0.22/0.53 0.22/0.53 # ------------------------------------------------- 0.22/0.53 # User time : 0.003 s 0.22/0.53 # System time : 0.003 s 0.22/0.53 # Total time : 0.005 s 0.22/0.53 # Maximum resident set size: 1700 pages 0.22/0.53 0.22/0.53 # ------------------------------------------------- 0.22/0.53 # User time : 0.003 s 0.22/0.53 # System time : 0.006 s 0.22/0.53 # Total time : 0.009 s 0.22/0.53 # Maximum resident set size: 1728 pages 0.22/0.53 % E exiting 0.22/0.53 % E exiting 0.22/0.53 EOF